A Matrix Lower Bound
نویسنده
چکیده
A matrix lower bound is defined that generalizes ideas apparently due to S. Banach and J. von Neumann. The matrix lower bound has a natural interpretation in functional analysis, and it satisfies many of the properties that von Neumann stated for it in a restricted case. Applications for the matrix lower bound are demonstrated in several areas. In linear algebra, the matrix lower bound of a full rank matrix equals the distance to the set of rank-deficient matrices. In numerical analysis, the ratio of the matrix norm to the matrix lower bound is a condition number for all consistent systems of linear equations. In optimization theory, the matrix lower bound suggests an identity for a class of min-max problems. In real analysis, a recursive construction that depends on the matrix lower bound shows that the level sets of continuously differentiable functions lie asymptotically near those of their tangents.
منابع مشابه
The Structure of Bhattacharyya Matrix in Natural Exponential Family and Its Role in Approximating the Variance of a Statistics
In most situations the best estimator of a function of the parameter exists, but sometimes it has a complex form and we cannot compute its variance explicitly. Therefore, a lower bound for the variance of an estimator is one of the fundamentals in the estimation theory, because it gives us an idea about the accuracy of an estimator. It is well-known in statistical inference that the Cram&eac...
متن کاملامید ریاضی نرخ پوشش برای ماتریسهای هلمن
Hellman’s time-memory trade-off is a probabilistic method for inverting one-way functions, using pre-computed data. Hellman introduced this method in 1980 and obtained a lower bound for the success probability of his algorithm. After that, all further analyses of researchers are based on this lower bound. In this paper, we first studied the expected coverage rate (ECR) of the Hellman matrice...
متن کاملSome inequalities involving lower bounds of operators on weighted sequence spaces by a matrix norm
Let A = (an;k)n;k1 and B = (bn;k)n;k1 be two non-negative ma-trices. Denote by Lv;p;q;B(A), the supremum of those L, satisfying the followinginequality:k Ax kv;B(q) L k x kv;B(p);where x 0 and x 2 lp(v;B) and also v = (vn)1n=1 is an increasing, non-negativesequence of real numbers. In this paper, we obtain a Hardy-type formula forLv;p;q;B(H), where H is the Hausdor matrix and 0 < q p 1. Also...
متن کاملInvestigation of structural, morphological and dynamic mechanical properties of unvulcanized PDMS/silica compound
In this study, the interaction between the silica filler and polydimethylsiloxanes (PDMS) was investigated from the aspects of the bound rubber and morphological characterization. With special attention to the dynamic properties, the dynamic test was conducted by dynamic shear rheometer. The results show that the modified fillers disperse uniformly within PDMS matrix without aggregation and con...
متن کاملLower Bounds of Copson Type for Hausdorff Matrices on Weighted Sequence Spaces
Let = be a non-negative matrix. Denote by the supremum of those , satisfying the following inequality: where , , and also is increasing, non-negative sequence of real numbers. If we used instead of The purpose of this paper is to establish a Hardy type formula for , where is Hausdorff matrix and A similar result is also established for where In particular, we apply o...
متن کامل